Concatenative type systems

relatively small implementation in Racket TODO link related thesis paper https://docs.factorcode.org/content/article-inference.html

Wim:

Right now I'm not approaching it that way. Funktal is statically typed with ordinary algebraic data types and function types, and that is enough to ensure a balanced stack. If it typechecks, the stack is balanced.

But it is not a forth, I only use postfix notation for expressions but essentially it's all lambda functions. There are no explicit stack manipulation operations.

…

It depends on how complex your dependent type system would be. If it is full Martin-Löf, the type checker will be very complex. But it it's just linear types, I think it might work.

Wim's typed concatenative functional language for Uxn